package U1;

public class Test3 {
	
	public int Fibonacci(int n) {
		if(n <= 1)
			return n;
		int res = 0;
		int n1 = 0,n2 = 1;
		for(int i = 2;i <= n; ++ i) {
			res = n1 + n2;
			n1 = n2;
			n2 = res;
		}
		return res;

	}

}
